Memetic algorithm for multi-tours dynamic vehicle routing problem with overtime (MDVRPOT)
نویسندگان
چکیده
منابع مشابه
A multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملMulti-GPU Parallel Memetic Algorithm for Capacitated Vehicle Routing Problem
The goal of this paper is to propose and test a new memetic algorithm for the capacitated vehicle routing problem in parallel computing environment. In this paper we consider a simple variation of the vehicle routing problem in which the only parameter is the capacity of the vehicle and each client only needs one package. We analyze the efficiency of the algorithm using the hierarchical Paralle...
متن کاملA Memetic Algorithm for the Vehicle Routing Problem with Cross Docking
In this paper we address the VRPCD, in which a set of homogeneous vehicles are used to transport products from the suppliers to customers via a cross-dock. The products can be consolidated at the cross-dock but cannot be stored for very long as the cross-dock does not have long-term inventory-holding capabilities. The objective of the VRPCD is to minimize the total traveled distance while respe...
متن کاملThe multi-shift vehicle routing problem with overtime
In this paper, we study a new variant of the vehicle routing problem (VRP) with time windows, multi-shift, and overtime. In this problem, a limited fleet of vehicles is used repeatedly to serve demand over a planning horizon of several days. The vehicles usually take long trips and there are significant demands near shift changes. The problem is inspired by a routing problem in healthcare, wher...
متن کاملA hybrid grouping genetic algorithm for the inventory routing problem with multi-tours of the vehicle
In this paper we analyze the inventory routing model as described recently by Aghezaff et al. in which the work of each vehicle can be organized in multi-tours: a vehicle comes back to the depot after the delivery of some-sales points and before visiting other sales-points. We propose a grouping genetic algorithm with a specific crossover operator adapted to this model; this algorithm is hybrid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Industrial Engineering Computations
سال: 2020
ISSN: 1923-2926,1923-2934
DOI: 10.5267/j.ijiec.2020.4.001